On an infinite dimensional linear-quadratic problem with fixed endpoints: The continuity question

نویسنده

  • K. Maciej Przyluski
چکیده

The existing theory of linear-quadratic problems has been successfully applied to the design of many industrial and military control systems (see, e.g., Athans, 1971). A stochastic version of this problem plays today an important role in macroeconomics, where the so-called linear-quadratic economies are considered (see, e.g., Ljungqvist and Sargent, 2004; Sent, 1998). These (dynamic stochastic) optimizing models had to have linear constraints with quadratic objective functions to get a linear decision rule (see, e.g., Chow, 1976; Kendrick, 1981). However, such stochastic problems are frequently infinite dimensional (see, e.g., the work of Federico (2011) and the references cited therein). We will consider infinite dimensional linear control systems which can be represented by two linear continuous operators describing the influence of control, and the constraints imposed on all of the system’s trajectories by given initial and final conditions. The minimum energy and linear-quadratic problems for such systems will be developed. These problems can be studied in an appropriate Hilbert space setting. Then (as is well known) the existence and uniqueness of optimal solutions to the above problems can be easily established, under rather mild assumptions. The purpose of our paper is to explore the conditions under which the solutions to the above-mentioned optimization problems continuously depend on initial and final conditions. Not surprisingly, these continuity (or discontinuity) conditions are strongly related to some concepts of controllability for infinite dimensional (linear) systems. The importance of the continuous dependence of the optimal solution upon the imposed initial and final conditions is obvious, in particular when developing numerical methods for the minimum energy or linear quadratic problem. For infinite dimensional linear control systems, the continuous dependence of optimal solutions on constraints on values of admissible controls has been considered by Przyłuski (1981). A much more general approach to such problems is presented by Kandilakis and Papageorgiou (1992) as well as Papageorgiou (1991).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nonexpansive mappings on complex C*-algebras and their fixed points

A normed space $mathfrak{X}$ is said to have the fixed point property, if for each nonexpansive mapping $T : E longrightarrow E $ on a nonempty bounded closed convex subset $ E $ of $ mathfrak{X} $ has a fixed point. In this paper, we first show that if $ X $ is a locally compact Hausdorff space then the following are equivalent: (i) $X$ is infinite set, (ii) $C_0(X)$ is infinite dimensional, (...

متن کامل

Implementation of infinite-dimensional interior-point method for solving multi-criteria linear-quadratic control problem

We describe an implementation of an infinite-dimensional primal-dual algorithm based on the Nesterov-Todd direction. Several applications to both continuous and discrete-time multi-criteria linear-quadratic control problems and linear-quadratic control problem with quadratic constraints are described. Numerical results show a very fast convergence (typically, within 3-4 iterations) to optimal s...

متن کامل

When the classical & quantum mechanical considerations hint to a single point; a microscopic particle in a one dimensional box with two infinite walls and a linear potential inside it

In this paper we have solved analytically the Schrödinger equation for a microscopic particle in a one-dimensional box with two infinite walls, which the potential function inside it, has a linear form. Based on the solutions of this special quantum mechanical system, we have shown that as the quantum number approaches infinity the expectation values of microscopic particle position and square ...

متن کامل

Solving Linear Semi-Infinite Programming Problems Using Recurrent Neural Networks

‎Linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints‎. ‎In this paper‎, ‎to solve this problem‎, ‎we combine a discretization method and a neural network method‎. ‎By a simple discretization of the infinite constraints,we convert the linear semi-infinite programming problem into linear programming problem‎. ‎Then‎, ‎we use...

متن کامل

Mixed Constrained Infinite Horizon Linear Quadratic Optimal Control

For a given initial state, a constrained infinite horizon linear quadratic optimal control problem can be reduced to a finite dimensional problem [12]. To find a conservative estimate of the size of the reduced problem, the existing algorithms require the on-line solutions of quadratic programs [10] or a linear program [2]. In this paper, we first show based on the Lyapunov theorem that the clo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computer Science

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2014